- consistency theorem
- мат.теорема о непротиворечивости
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Robinson's joint consistency theorem — is an important theorem of mathematical logic. It is related to Craig interpolation and Beth definability.The classical formulation of Robinson s joint consistency theorem is as follows:Let T 1 and T 2 be first order theories. If T 1 and T 2 are… … Wikipedia
Consistency — For other uses, see Consistency (disambiguation). In logic, a consistent theory is one that does not contain a contradiction.[1] The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a … Wikipedia
Theorem — The Pythagorean theorem has at least 370 known proofs[1] In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements … Wikipedia
Gentzen's consistency proof — Gentzen s theoremIn 1936 Gerhard Gentzen proved the consistency of first order arithmetic using combinatorial methods. Gentzen s proof shows much more than merely that first order arithmetic is consistent. Gentzen showed that the consistency of… … Wikipedia
Proof sketch for Gödel's first incompleteness theorem — This article gives a sketch of a proof of Gödel s first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses which are discussed as needed during the sketch. We will assume for the… … Wikipedia
Löwenheim–Skolem theorem — In mathematical logic, the Löwenheim–Skolem theorem, named for Leopold Löwenheim and Thoralf Skolem, states that if a countable first order theory has an infinite model, then for every infinite cardinal number κ it has a model of size κ. The… … Wikipedia
Fluctuation theorem — The fluctuation theorem (FT) is a theorem from statistical mechanics dealing with the relative probability that the entropy of a system which is currently away from thermodynamic equilibrium (maximum entropy) will increase or decrease over a… … Wikipedia
Paris–Harrington theorem — In mathematical logic, the Paris–Harrington theorem states that a certain combinatorial principle in Ramsey theory is true, but not provable in Peano arithmetic. This was the first natural example of a true statement about the integers that could … Wikipedia
CAP-Theorem — Das CAP Theorem oder Brewer s Theorem besagt, dass es für ein System zum verteilten Rechnen unmöglich ist, gleichzeitig die drei Eigenschaften Konsistenz, Verfügbarkeit und Partitionstoleranz zu garantieren.[1][2] Inhaltsverzeichnis 1… … Deutsch Wikipedia
Cox's theorem — Cox s theorem, named after the physicist Richard Threlkeld Cox, is a derivation of the laws of probability theory from a certain set of postulates. This derivation justifies the so called logical interpretation of probability. As the laws of… … Wikipedia
Gödel's completeness theorem — is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first order logic. It was first proved by Kurt Gödel in 1929. A first order formula is called logically valid if… … Wikipedia